Shortest path problem

Results: 829



#Item
411NP-complete problems / Network theory / Graph coloring / Graph partition / Shortest path problem / Connectivity / Minimum spanning tree / Breadth-first search / Theoretical computer science / Graph theory / Mathematics

tunning_parameter_running_time_machine_number.eps

Add to Reading List

Source URL: www.vldb.org

Language: English - Date: 2014-11-12 16:57:53
412Search algorithms / Network theory / Shortest path problem / Breadth-first search / Graph / Homomorphic encryption / Graph connectivity / Graph theory / Mathematics / Theoretical computer science

GRECS: Graph Encryption for Approximate Shortest Distance Queries Xianrui Meng∗1 , Seny Kamara†2 , Kobbi Nissim‡3 , and George Kollios§1 1 Department of Computer Science, Boston University

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2015-03-22 08:44:39
413Network theory / Chord / Distributed data storage / Connectivity / Bridge / Shortest path problem / Topology / LU decomposition / Mathematics / Graph theory / Theoretical computer science

Fast and Exact Top-k Search for Random Walk with Restart Yasuhiro Fujiwara∗‡ , Makoto Nakatsuji† , Makoto Onizuka∗ , Masaru Kitsuregawa‡ ∗NTT Cyber Space Labs, †NTT Cyber Solutions Labs, ‡The University o

Add to Reading List

Source URL: vldb.org

Language: English - Date: 2012-01-21 14:29:58
414Trie / Shortest path problem / EMD E-unit / Rail transport / Land transport / Graph theory

PRESS: A Novel Framework of Trajectory Compression in Road Networks Renchu Song†⋆ Weiwei Sun†⋆ Baihua Zheng‡ Yu Zheng§ † ⋆

Add to Reading List

Source URL: www.vldb.org

Language: English - Date: 2014-04-05 17:13:22
415Network theory / NP-complete problems / Graph partition / Shortest path problem / Centrality / Graph / Apache Hama / Connectivity / Graph theory / Mathematics / Theoretical computer science

Microsoft Word - ipdps_graph-camera

Add to Reading List

Source URL: ceng.usc.edu

Language: English - Date: 2013-01-28 15:54:56
416Network flow / Operations research / Routing algorithms / Network theory / Bellman–Ford algorithm / Shortest path problem / Dynamic programming / Induced path / Maximum flow problem / Mathematics / Graph theory / Theoretical computer science

COMS21103 Given a (weighted, directed) graph G and a pair of vertices s and t, we would like to find a shortest path from s to t. A fundamental task with many applications:

Add to Reading List

Source URL: www.cs.bris.ac.uk

Language: English - Date: 2014-01-08 09:09:07
417Network theory / Routing protocols / Routing / Link-state routing protocol / Overlay network / Peer-to-peer / Shortest path problem / Tapestry / Computer architecture / Computing / Network architecture

Backup Path Allocation Based On A Correlated Link Failure Probability Model In Overlay Networks Weidong Cui, Ion Stoica, Randy H. Katz Department of Electrical Engineering and Computer Science University of California at

Add to Reading List

Source URL: www.cs.berkeley.edu

Language: English - Date: 2003-10-10 14:58:33
418Operations research / Canadian traveller problem / Rollout / Shortest path problem / Algorithm / Mathematics / Theoretical computer science / Applied mathematics

High-Quality Policies for the Canadian Traveler’s Problem (Extended Abstract) Patrick Eyerich and Thomas Keller and Malte Helmert Albert-Ludwigs-Universit¨at Freiburg Institut f¨ur Informatik Georges-K¨ohler-Allee 5

Add to Reading List

Source URL: gki.informatik.uni-freiburg.de

Language: English - Date: 2010-06-22 14:58:59
419Operations research / Dynamic programming / Routing algorithms / Finite fields / Optimal control / XTR / Sensor / Shortest path problem / Floyd–Warshall algorithm / Mathematics / Theoretical computer science / Applied mathematics

Y:/workspace/work/research/papers/icra11[removed]paper.dvi

Add to Reading List

Source URL: msl.cs.uiuc.edu

Language: English - Date: 2011-10-14 01:37:09
420Robot control / Motion planning / Probabilistic roadmap / Point location / Shortest path problem / Path / Tree / Search algorithm / SL / Theoretical computer science / Graph theory / Mathematics

Motion Planning: The Essentials Steven M. LaValle This is the first installment of a two-part tutorial. The goal of the first part is to give the reader a basic understanding of the technical issues and types of approach

Add to Reading List

Source URL: msl.cs.uiuc.edu

Language: English - Date: 2011-10-14 01:50:44
UPDATE